One dimensional fibering over q-complete spaces
نویسندگان
چکیده
منابع مشابه
Safe Q-Learning on Complete History Spaces
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observations and actions. A novel and sound technique for learning a Q-function on history spaces is developed and discussed. We analyze certain conditions under which a history based approach is able to learn policies compar...
متن کاملOn the theory of q-complete spaces
Let X be a complex space and f : X → I R a real valued function. Then f is said to be q-convex if for any x ∈ X there exist a neighborhood U which is biholomorphic to a closed analytic set in an open set Ω ⊂ I C and a function g ∈ C(Ω) such that i∂∂g has at most q − 1 zero or negative eigenvalues at each point of Ω and f |U = g|U . The space X is called q-complete if there exists an exhaustion ...
متن کاملCommutative curvature operators over four-dimensional generalized symmetric spaces
Commutative properties of four-dimensional generalized symmetric pseudo-Riemannian manifolds were considered. Specially, in this paper, we studied Skew-Tsankov and Jacobi-Tsankov conditions in 4-dimensional pseudo-Riemannian generalized symmetric manifolds.
متن کاملOne-Dimensional Logic over Trees
A one-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential quantifiers that leave at most one variable free. This fragment contains two-variable logic, and it is known that over words both formalisms have the same complexity and expressive power. Here we investigate the one-dimensional fragment over trees. We consider unranked unordered tr...
متن کاملOne-Dimensional Logic over Words
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential quantifiers that leave at most one variable free. We investigate one-dimensional fragment over words and over ω-words. We show that it is expressively equivalent to the twovariable fragment of first-order logic. We also show that its satisfiability problem is NExpTimecomplete. Furthe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1998
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000025198